ASIC - to - Spartan Adaptation Adapting ASIC Designs for Use with Spartan FPGAs
ثبت نشده
چکیده
Spartan FPGAs are an exciting, new alternative for implementing digital designs that, previously, would have employed ASIC 1 technology. Pre-existing ASIC intellectual property 2 can be adapted for use with Spartan devices by following a straightforward procedure. Each step of the pro-1. For the purposes of this application note, ASIC refers to mask gate array. 2. The term intellectual property includes preexisting design material (i.e. legacy code), cores, and vendor ASIC libraries. cedure is explained in detail. Guidelines show how an ASIC design, in the form of an RTL-level HDL 3 file, can be revised to take full advantage of the Spartan series' capabilities , thereby achieving efficient, high-performance implementations. 3. Two kinds of Hardware Description Language (HDL) are recommended for the ASIC-to-FPGA design adaptation: VHDL and Verilog.
منابع مشابه
Review of stream cipher candidates from a low resource hardware perspective
This paper presents hardware implementation and analysis of a carefully selected sub-set of the candidate stream ciphers submitted to the European Union eStream project. Only the submissions without licensing restrictions have been considered. The sub-set of six was defined based on memory requirements versus the Advanced Encryption Standard and any published security analysis. A number of comp...
متن کاملBuilt-In Self-Test Quality Assessment Using Hardware Fault Emulation In FPGAs
This paper addresses the problem of test quality assessment, namely of BIST solutions, implemented in FPGA and/or in ASIC, through Hardware Fault Emulation (HFE). A novel HFE methodology and tool is proposed, that, using partial reconfiguration, efficiently measures the quality of the BIST solution. The proposed HFE methodology uses Look-Up Tables (LUTs) fault models and is performed using loca...
متن کاملFpga and Asic Implementation of Rho and P-1 Methods of Factoring
FPGA AND ASIC IMPLEMENTATION OF RHO AND P-1 METHODS OF FACTORING Ramakrishna Bachimanchi, MS George Mason University, 2007 Thesis Director: Dr. Kris Gaj One of the main challenges in the cryptography is breaking RSA-1024. The problem can be explained as factoring large integers. The suitable methods for this purpose are Multiple Polynomial Quadratic Sieve (MPQS) and Number Field Sieve (NFS). Ou...
متن کاملDesign and Characterization of Fault Tolerant Power Parallel Prefix Adders using FPGA Design
Parallel-prefix adders (also known as carry tree adders) are known to have the best performance in VLSI designs. However, this performance advantage does not translate directly into FPGA implementations due to constraints on logic block configurations and routing overhead. This paper investigates three types of carry-tree adders (the Kogge-Stone, sparse Kogge-Stone, and spanning tree adder) and...
متن کاملThe Low - Cost , Efficient Serial Configuration of Spartan FPGAs
This application note shows how to achieve low-cost, efficient serial configuration for Spartan FPGA designs. The approach recommended here takes advantage of unused resources in a design, thereby reducing the cost, part count, memory size, and board space associated with the serial configuration circuitry. As a result, neither processor nor PROM needs to be fully dedicated to performing Sparta...
متن کامل